A logarithmic barrier cutting plane method for convex programming*
نویسنده
چکیده
Users may download and print one copy of any publication from the public portal for the purpose of private study or research You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright, please contact us providing details, and we will remove access to the work immediately and investigate your claim.
منابع مشابه
Polynomial interior point cutting plane methods
Polynomial cutting plane methods based on the logarithmic barrier function and on the volumetric center are surveyed. These algorithms construct a linear programming relaxation of the feasible region, find an appropriate approximate center of the region, and call a separation oracle at this approximate center to determine whether additional constraints should be added to the relaxation. Typical...
متن کاملA Long-Step, Cutting Plane Algorithm for Linear and Convex Programming
A cutting plane method for linear programming is described. This method is an extension of Atkinson and Vaidya’s algorithm, and uses the central trajectory. The logarithmic barrier function is used explicitly, motivated partly by the successful implementation of such algorithms. This makes it possible to maintain primal and dual iterates, thus allowing termination at will, instead of having to ...
متن کاملLogarithmic barrier decomposition methods
A computational study of some logarithmic barrier decomposition algorithms for semi{innnite programming is presented in this paper. The conceptual algorithm is a straightforward adaptation of the logarithmic barrier cutting plane algorithm which was presented recently by den Hertog et al., to solve semi-innnite programming problems. Usually decomposition (cutting plane methods) use cutting plan...
متن کاملConvex Nondifferentiable Optimization: a Survey Focussed on the Analytic Center Cutting Plane Method
We present a survey of nondiierentiable optimization problems and methods with special focus on the analytic center cutting plane method. We propose a self-contained convergence analysis, that uses the formalism of the theory of self-concordant functions, but for the main results, we give direct proofs based on the properties of the logarithmic function. We also provide an in depth analysis of ...
متن کاملA class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming
Ariyawansa and Zhu [5] have recently proposed a new class of optimization problems termed stochastic semidefinite programs (SSDP’s). SSDP’s may be viewed as an extension of two-stage stochastic (linear) programs with recourse (SLP’s). Zhao [25] has derived a decomposition algorithm for SLP’s based on a logarithmic barrier and proved its polynomial complexity. Mehrotra and Özevin [17] have exten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993